Star Mapping Algorithm

نویسنده

  • Darick W. LaSelle
چکیده

This paper proposes a project investigating how to map a set of points (presumed to be stars) onto a star map. It will implement an algorithm that does star mapping and explore the robustness of the algorithm. Keywords— digital image; point-matching star map;

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intelligent Mapping

This paper is directed to the question of how to model and design an efficient tool for the intelligent mapping which is based on both dynamic and efficient storage of data and soft computing. The former is performed by our method that learns how to store, search and delete the data. After pointing out the limitation of the crisp evaluation of the distance between two points, we argue in favor ...

متن کامل

ارائه الگوریتم شناسایی ستاره بر مبنای رأی‌گیری هندسی به منظور استفاده در ردیاب‌های ستاره‌ای

Star identification is one of the most important stages in attitude determination with star trackers. This can be performed using matching algorithms between observed stars and a master star catalogue. The main challenge in this approach is to provide a fast and reliable identification algorithm that is sufficiently robust in different pointing views of the star tracker optical system in the sp...

متن کامل

الگوریتمی جدید در تشخیص قالب و مرکزیابی دقیق ستارگان تصاویر آسمان شب

In this paper a novel night sky star pattern recognition and precise centroiding approaches are proposed. Precision and computation time of image processing algorithm paly a great role in spacecraft in which the night sky star images are utilized for attitude determination. Star pattern recognition and centroiding are the most important steps of image processing algorithm in such attitude deter...

متن کامل

A New Method for Color Gamut Mapping by Genetic Algorithm

To reproduce an image, it is necessary to map out of gamut colors of the image to destination gamut. It is clear that the best color gamut mapping introduces the perceptually closest image to the original one. In this study, a new color gamut mapping is purposed by the aid of Genetic Algorithm (GA). The color difference between the original and mapped images based on S-LAB formula was chosen as...

متن کامل

Nonexpansive mappings on complex C*-algebras and their fixed points

A normed space $mathfrak{X}$ is said to have the fixed point property, if for each nonexpansive mapping $T : E longrightarrow E $ on a nonempty bounded closed convex subset $ E $ of $ mathfrak{X} $ has a fixed point. In this paper, we first show that if $ X $ is a locally compact Hausdorff space then the following are equivalent: (i) $X$ is infinite set, (ii) $C_0(X)$ is infinite dimensional, (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015